muCap: Connecting FaceReaderTM to z-Tree∗
نویسندگان
چکیده
μCap (muCap) is a software package (citeware) for economic experiments enabling experimenters to analyze emotional states of subjects using z-Tree and FaceReaderTM. μCap is able to create videos of subjects on client computers based on stimuli shown on screen and restrict recording material to relevant time frames. Another feature of μCap is the creation of time stamps in csv format at prespecified screens (or at prespecified points in time) during the experiment, measured on the client computer. The software makes it possible to import these markers into FaceReaderTM easily. Until recently, connecting z-Tree and FaceReaderTM was only possible using workarounds or by undertaking many successive actions manually. μCap is the first program that significantly simplifies this process with the additional benefit of extremely high precision. This paper describes the usage, underlying principles as well as advantages and limitations of μCap. Furthermore, we give a brief outlook of how μCap can be beneficial in other contexts. JEL-Classification: C90, C91, C99.
منابع مشابه
Connecting Yule Process, Bisection and Binary Search Tree via Martingales
We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.
متن کاملIdentification of Salmonellae with the 4-methylumbelliferyl caprilate fluorescence test.
We have tested 750 Salmonella strains and 130 strains of other species of the family Enterbacteriaceae with the 4-methylumbelliferyl caprilate reagent (MUCAP) test. The MUCAP test is a fluorescence test for rapid identification of Salmonella strains. The non-Salmonella strains were strains sent for identification as suspected Salmonella strains and thus have phenotypes similar to those of Salmo...
متن کاملA Space-bounded Learning of Classes with Vc-dim = 1 Proof: Combine Theorem 3 with Corollary 2. 5 Extensions
If the algorithm has in its memory two points x + ; x ? then the algorithm performs a binary search on the path connecting x + and x ? as follows: the algorithm picks the node y 2 which is the middle point on the path connecting x + and x ? ; the algorithm deenes an hypothesis h using the branch leading to y 2 and asks an equivalence query EQ(h). If the answer to the query is \YES" it stops wit...
متن کاملA test bench for evaluating spatial indexation methods for connecting points to large networks
This study deals with performance issues for connecting points to a network in geographic accessibility studies. The problem is analysed by the development of a test bench where the spatial indexation methods kD-tree, Morton code and fixed grid are implemented. Using the test bench scenarios of networks, point datasets, spatial indexation methods, and methods for computing distances between poi...
متن کاملDetailed Scheduling of Tree-like Pipeline Networks with Multiple Refineries
In the oil supply chain, the refined petroleum products are transported by various transportation modes, such as rail, road, vessel and pipeline. The latter provides one of the safest and cheapest ways to connect production areas to local markets. This paper addresses the operational scheduling of a multi-product tree-like pipeline connecting several refineries to multiple distribution centers ...
متن کامل